Formal reliability analysis of combinational circuits using theorem proving
نویسندگان
چکیده
Reliability analysis of combinational circuits has become imperative these days due to the extensive usage of nanotechnologies in their fabrication. Traditionally, reliability analysis of combinational circuits is done using simulation or paper-and-pencil proof methods. But, these techniques do not ensure accurate results and thus may lead to disastrous consequences when dealing with safety-critical applications. In this paper, we mainly tackle the accuracy problem of these traditional reliability analysis approaches by presenting a formal reliability analysis framework based on higher-order-logic theorem proving. We present the higher-order-logic formalization of the notions of fault and reliability for combinational circuits and formally verify the von-Neumann fault models for most of the commonly used logic gates, such as, AND, NOT, OR, etc. This formal infrastructure is then used along with a computer program, written in C++, to automatically reason about the reliability of any combinational circuit within a higher-order-logic theorem prover (HOL). For illustration purposes, we utilize the proposed framework to analyze the reliability of a few benchmark combinational circuits.
منابع مشابه
Proof Strategies for Hardware Verification - Aerospace and Electronics Conference, 1996. NAECON 1996., Proceedings of the IEEE 1996 National
Ascertaining correctness of digital hardware designs through simulation does not scale-up for large designs because of the sheer combinatorics of the problem. Formal verification of hardware designs holds promise because its computational complexity is of the order of number of different types of components (and not number of components in the design). This approach requires the specification o...
متن کاملA short introduction to two approaches in formal verification of security protocols: model checking and theorem proving
In this paper, we shortly review two formal approaches in verification of security protocols; model checking and theorem proving. Model checking is based on studying the behavior of protocols via generating all different behaviors of a protocol and checking whether the desired goals are satisfied in all instances or not. We investigate Scyther operational semantics as n example of this...
متن کاملSafety Property Verification of Cyclic Synchronous Circuits
Today’s most common formal verification tools for hardware are unable to deal with circuits containing combinational loops. However, in the areas of hardware compilation, circuit synthesis and circuit optimization, it is quite natural for a subclass of these loops, the so-called constructive loops, to arise. These are loops that physically exist in a circuit, but are never logically taken. In t...
متن کاملAutomatic Veriication of Combinational and Pipelined Fft Circuits
We describe how three hardware components (two combina-tional and one pipelined) for computing the Fast Fourier Transform have been automatically proved equivalent using a combination of rewriting techniques, symbolic simulation, induction and a general purpose theorem prover. We present some advice on how to verify circuits operating on complex data, and exemplify this by a general purpose pro...
متن کاملFormal Reliability Analysis using Higher-Order Logic Theorem Proving
Formal Reliability Analysis using Higher-Order Logic Theorem Proving Naeem Ahmad Abbasi, Ph. D. Concordia University, 2012 Traditional techniques used in the reliability analysis of engineering systems have limitations. Paper-and-pencil based analysis is prone to human error and simulation based techniques cannot be computationally one hundred percent accurate. An alternative to these two tradi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Applied Logic
دوره 9 شماره
صفحات -
تاریخ انتشار 2011